Bayesian variable selection and the Swendsen-Wang algorithm

نویسندگان

  • David J. Nott
  • Peter J. Green
چکیده

The need to explore model uncertainty in linear regression models with many predictors has motivated improvements in Markov chain Monte Carlo sampling algorithms for Bayesian variable selection. Traditional sampling algorithms for Bayesian variable selection may perform poorly when there are severe multicollinearities amongst the predictors. In this paper we describe a new sampling method based on an analogy with the Swendsen-Wang algorithm for the Ising model, and which can give substantial improvements over traditional sampling schemes in the presence of multicollinearity. In linear regression with a given set of potential predictors we can index different possible models by a binary parameter vector which indicates which of the predictors are included or excluded. By thinking of the posterior distribution of this parameter as a binary spatial field, we can approximate the posterior distribution by an Ising model and then apply a modified Swendsen-Wang algorithm for sampling from the posterior where dependence among parameters is reduced by conditioning on auxiliary variables. Performance of the method is described for both simulated and real data.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning Bayesian Network Structure using Markov Blanket in K2 Algorithm

‎A Bayesian network is a graphical model that represents a set of random variables and their causal relationship via a Directed Acyclic Graph (DAG)‎. ‎There are basically two methods used for learning Bayesian network‎: ‎parameter-learning and structure-learning‎. ‎One of the most effective structure-learning methods is K2 algorithm‎. ‎Because the performance of the K2 algorithm depends on node...

متن کامل

Learnable Swendsen-Wang Cuts for Image Segmentation

We propose a framework for Bayesian unsupervised image segmentation with descriptive, learnable models. Our approach is based on learning descriptive models for segmentation and applying Monte Carlo Markov chain to traverse the solution space. Swendsen-Wang cuts are adapted to make meaningful jumps in solution space.

متن کامل

Auxilliary Variables for Markov Random Fields with Higher Order Interactions

Markov Random Fields are widely used in many image processing applications. Recently the shortcomings of some of the simpler forms of these models have become apparent, and models based on larger neighbourhoods have been developed. When single-site updating methods are used with these models, a large number of iterations are required for convergence. The Swendsen-Wang algorithm and Partial Deco...

متن کامل

Project Portfolio Risk Response Selection Using Bayesian Belief Networks

Risk identification, impact assessment, and response planning constitute three building blocks of project risk management. Correspondingly, three types of interactions could be envisioned between risks, between impacts of several risks on a portfolio component, and between several responses. While the interdependency of risks is a well-recognized issue, the other two types of interactions remai...

متن کامل

Comparison of Swendsen-Wang and heat-bath dynamics

We prove that the spectral gap of the Swendsen-Wang process for the Potts model on graphs with bounded degree is bounded from below by some constant times the spectral gap of any single-spin dynamics. This implies rapid mixing for the two-dimensional Potts model at all temperatures above the critical one, as well as rapid mixing at the critical temperature for the Ising model. After this we int...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004